Exactly Solvable Fermionic N-chain Models

Motivated by the problem of N coupled Hubbard chains, we investigate a generalisation of the Schulz-Shastry model containing two species of one-dimensional fermions interacting via a gauge field that depends on the positions of all the particles of the other species. The exact many body ground state of the model can be easily obtained through a unitary transformation of the model. The correlation functions are Luttinger-like - i.e., they decay through power laws with non-integer exponents. Through the interaction dependent correlation functions of the two-particle operators, we identify the relevant perturbations and hence, possible instabilities.Comment: 10 pages, 1 eps figure, Late

Factors Influencing the Adoption of Recommended Package of Practices by Pepper Growers of Wayanad District, Kerala

The study aims to assess the relationship between the profile of the farmers with their adoption level on recommended package of practices on pepper cultivation. The study was conducted in Panamaram block of Wayanad district in Kerala and proportionate random sampling was employed to select a sample of 120 members from the selected three villages of the block. It was observed that the factors viz., educational status, farm size, area under pepper cultivation, income, social participation, extension agency contact, mass media exposure, innovativeness, trainings undergone, market decision and market potential showed positive significant correlation at one per cent level of probability and market perception showed positive significant correlation at five per cent level of probability towards adoption level. Results revealed that one unit increase in the independent variables viz., farm size, extension agency contact and market decision would increase the adoption level by 2.549, 1.033 and 1.159 units respectively

Detection of Link Failures and Autonomous Reconfiguration in WMNs

During their lifetime, multihop wireless mesh networks (WMNs) experience frequent link failures caused by channel interference, dynamic obstacles, and/or applications’ bandwidth demands. By reconfiguring these link failures ARS generates an effective reconfiguration plan that requires only local network configuration changes by exploiting channel, radio, and path diversity. ARS effectively identifies reconfiguration plans that satisfy QoS constraints. And ARS's online reconfigurability allows for real-time time failure detection and network reconfiguration. ARS is mainly evaluated in IEEE 802.11a networks. It's design goal is to reconfigure from network link failures accurately. Even then WMNs face some frequent link failures. By overcome these problems  we present Localized sElf-reconfiGuration algOrithms  (LEGO) to autonomously and effectively  recnfigure from wireless link failures. First, LEGO locally detects link failures. Second, it dynamically forms/deforms a local group for cooperative network reconfiguration among local mesh routers in a fully distributed manner. Next, LEGO intelligently generates a local network reconfiguration plan. Finally, by figuring local channel utilization and reconfiguration cost in its planning, LEGO maximizes the network’s ability to meet diverse links’ QoS demands. LEGO has been implemented on a Linux-based system and experimented on a real life test bed, demonstrating its effectiveness in recovering from link failures and its improvement of channel efficiency by up to 92%. Keywords - Self-Reconfigurable Networks, Multi-Radio Wireless Networks, IEEE 802.11, WLAN access points (AP)

A Comparative Study of Redundant Constraints Identification Methods in Linear Programming Problems

The objective function and the constraints can be formulated as linear functions of independent variables in most of the real-world optimization problems. Linear Programming (LP) is the process of optimizing a linear function subject to a finite number of linear equality and inequality constraints. Solving linear programming problems efficiently has always been a fascinating pursuit for computer scientists and mathematicians. The computational complexity of any linear programming problem depends on the number of constraints and variables of the LP problem. Quite often large-scale LP problems may contain many constraints which are redundant or cause infeasibility on account of inefficient formulation or some errors in data input. The presence of redundant constraints does not alter the optimal solutions(s). Nevertheless, they may consume extra computational effort. Many researchers have proposed different approaches for identifying the redundant constraints in linear programming problems. This paper compares five of such methods and discusses the efficiency of each method by solving various size LP problems and netlib problems. The algorithms of each method are coded by using a computer programming language C. The computational results are presented and analyzed in this paper

Birds in Sangam Literature

Living things in world is of two division one is plants and the other is animals. Animals are both single-celled and multi-celled and the multi-celled animals have invertebrates. Animals without invertebrates are the water-dwelling fishes, the water-land-dwelling frogs, the crawling snake, crocodiles and so on. The poets of the Sangam period who looked closely at the birds have studied their life patterns. Sangha literature characterizes birds as 'Pullinangal'. Only the peacock and the parrot are better described among the Pullinangal. Asunam, Thutunam, Puravu, Chicks, Bettle and Iruthalaipul are some of the birds described in Sangam literature. Sangam songs describes how these birds live in the five regions of Kurinji, Mullai, Marutham, Neithal and Palai. Thus the article examines the birds shot in the five land forms of Tamilnadu

ON SOSHEARENERGY OF TREES OF DIAMETER 4 - PART I

Let G = (V, E) be a simple, non-trivial, finite, connected graph. A set D V is a dominating set of G if every vertex in V-D is adjacent to some vertex in D. A dominating set D of G is called a minimal dominating set if no proper subset of D is a dominating set. Shear Energy of a graph with respect to the minimal dominating set in terms of idegree and odegree was introduced by B. D. Acharya et al [1]. There are many patterns in trees of diameter 4. In this paper, 4 patterns of trees of diameter 4 are considered and soShearEnergy are calculated for all possible minimal dominating set. SoShearEnergy curve for those graphs are plotted. Remaining patterns are discussed in the papers to come

Trivially extendable graphs

Let G be a simple graph. Let k be a positive integer. G is said to be k-extendable if every independent set of cardinality k is contained in a maximum independent set of G. G is said to be trivially extendable if G is not k-extendable for 1 ≤ k ≤ (β0(G) − 1). A well covered graph is one in which every maximal independent set is maximum. Study of k-extendable graphs has been made in [7,8,9]. In this paper a study of trivially extendable graphs is made. Characterization of graphs with β0(G) = (n − 3) and which is trivially extendable has been done. Similarly graphs with β0(G) = (n − 2) is also studied for trivial extensibility.Publisher's Versio